Discrepancy theory and quasi-Monte Carlo integration
نویسنده
چکیده
* In this article we show the deep connections between discrepancy theory on the one hand and quasi-Monte Carlo integration on the other. Discrepancy theory was established as an area of research going back to the seminal paper by Weyl (1916), whereas Monte Carlo (and later quasi-Monte Carlo) was invented in the 1940s by John von Neumann and Stanislaw Ulam to solve practical problems. The connection between these areas is well understood and will be presented here. We further include state of the art methods for quasi-Monte Carlo integration.
منابع مشابه
Quasi-monte Carlo Integration over a Simplex and the Entire Space
Monte Carlo integration is a widely used method to approximate high dimensional integrals. However, the randomness of this method causes the convergence to be very slow. Quasi-Monte Carlo integration uses low discrepancy sequences instead of pseudorandom sequences. The points from these sequences are more uniformly distributed. This causes the convergence to be much faster. Most research in qua...
متن کاملMonte Carlo and quasi-Monte Carlo methods
Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N~^), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Ca...
متن کاملDigital Nets and Sequences Discrepancy Theory and Quasi-Monte Carlo Integration
Indispensable for students, invaluable for researchers, this comprehensive treatment of contemporary quasi–Monte Carlo methods, digital nets and sequences, and discrepancy theory starts from scratch with detailed explanations of the basic concepts and then advances to current methods used in research. As deterministic versions of the Monte Carlo method, quasi–Monte Carlo rules have increased in...
متن کاملParallel Quasi-Monte Carlo Integration Using (t, s)-Sequences
Currently, the most eeective constructions of low-discrepancy point sets and sequences are based on the theory of (t; m; s)-nets and (t; s)-sequences. In this work we discuss parallelization techniques for quasi-Monte Carlo integration using (t; s)-sequences. We show that leapfrog parallelization may be very dangerous whereas block-based paral-lelization turns out to be robust.
متن کاملError in Monte Carlo, quasi-error in Quasi-Monte Carlo
While the Quasi-Monte Carlo method of numerical integration achieves smaller integration error than standard Monte Carlo, its use in particle physics phenomenology has been hindered by the abscence of a reliable way to estimate that error. The standard Monte Carlo error estimator relies on the assumption that the points are generated independently of each other and, therefore, fails to account ...
متن کامل